Sudoku art
نویسندگان
چکیده
Sudoku, the popular logic puzzle, would have a greater artistic appeal if the final completed puzzle could be transformed into an image similar to nonogram outputs. To do this, we solve a mixed-integer nonlinear programming problem (MINLP) to find the Sudoku configuration that most closely represents a target image via an integer-colour mapping. This alone produces inadequate results, so we relax the problem by adding transparent regions to the target image and removing certain MINLP constraints. To produce puzzles that are feasible and interesting to players, additional components are added to avoid tedious recounting and unnecessary colouring.
منابع مشابه
Optimized CNF Encoding for Sudoku Puzzles
A Sudoku puzzle can be regarded as a propositional SAT problem. Various encodings are known for encoding Sudoku as a Conjunctive Normal Form(CNF) formula. Using these encodings for large Sudoku puzzles, however, generates too many clauses, which impede the performance of state-of-the-art SAT solvers. This paper presents an optimized CNF encoding in order to deal with large instances of Sudoku p...
متن کاملSolving and Rating Sudokus using Constraint Satisfiability Approaches and Genetic Algorithms
Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This project addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT encodings for Sudoku: the minimal encoding a...
متن کاملA Hybrid Heuristic Approach for the Sudoku problem
Sudoku is not only a popular puzzle but also an interesting constraint satisfaction problem. Therefore automatic solving methods for this problem have been the subject of several publications in the last decade. While some authors propose algorithms which make use of constraint programming techniques, others propose meta-heuristics and stochastic search to tackle larger instances of the puzzle....
متن کاملRecurrent Relational Networks for Complex Relational Reasoning
Humans possess an ability to abstractly reason about objects and their interactions, an ability not shared with state-of-the-art deep learning models. Relational networks, introduced by Santoro et al. (2017), add the capacity for relational reasoning to deep neural networks, but are limited in the complexity of the reasoning tasks they can address. We introduce recurrent relational networks whi...
متن کاملSudoku Associated Two Dimensional Bijections for Image Scrambling
Sudoku puzzles are now popular among people in many countries across the world with simple constraints that no repeated digits in each row, each column, or each block. In this paper, we demonstrate that the Sudoku configuration provides us a new alternative way of matrix element representation by using block-grid pair besides the conventional row-column pair. Moreover, we discover six more matr...
متن کامل